Laurier Flow
⌘K

© 2026 LaurierFlow. All rights reserved.

AboutPrivacy

Reviews

No Reviews With Body Yet

Contributed by Students

Course Outlines

to view and upload course outlines

CP 414

Foundations of Computing

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem. Prerequisites: CP312; and one of CP214 or MA238.

0%Liked
0%Easy
0%Useful
Based on 0 ratings

Prerequisites

CP 312 (Min. Grade D-) and (CP 214 (Min. Grade D-) or MA 238 (Min. Grade D-) )

Leads To

No Leads To Information Available

Restrictions

Must be enrolled in one of the following Levels:Undergraduate (UG)Cannot be enrolled in one of the following Year Levels:Year 1 (1)Not Applicable (N)

Schedule